Contact handle decompositions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Handle Moves in Contact Surgery Diagrams

We describe various handle moves in contact surgery diagrams, notably contact analogues of the Kirby moves. As an application of these handle moves, we discuss the respective classifications of long and loose Legendrian knots.

متن کامل

Planar Open Book Decompositions and Contact Structures

In this note we observe that while all overtwisted contact structures on compact 3–manifolds are supported by planar open book decompositions, not all contact structures are. This has relevance to the Weinstein conjecture [1] and invariants of contact structures.

متن کامل

Open Book Decompositions for Contact Structures on Brieskorn Manifolds

In this paper, we give an open book decomposition for the contact structures on some Brieskorn manifolds, in particular for the contact structures of Ustilovsky. The decomposition uses right-handed Dehn twists as conjectured by Giroux. 0. Introduction At the ICM of 2002 Giroux announced some of his results concerning a correspondence between contact structures on manifolds and open book structu...

متن کامل

Lectures on Open Book Decompositions and Contact Structures

This theorem plays a pivotal role in studying cobordisms of contact structures and understanding filling properties of contact structures, see [2, 6, 14, 13, 16, 19]. This better understanding of fillings leads to various topological applications of contact geometry. Specifically, the much studied property P for knots was established by Kronheimer and Mrowka in [28]. A non-trivial knot has prop...

متن کامل

Finding Branch-Decompositions and Rank-Decompositions

We present a new algorithm that can output the rank-decomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid represented over a fixed finite field, outputs its branch-decomposition of width at most k if such exists. This algorithm works also for partitioned matroids. Both these algorithms are fixed-parameter tractable, that is, they run...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2011

ISSN: 0166-8641

DOI: 10.1016/j.topol.2011.01.020